Consider the following recursive function find.int find (int A[], int n){int sum=0;if(n==0) return0;sum = find(A, n-1)if (A[n-1]

Question

Consider the following recursive function find.
int find (int A[], int n)
{
int sum=0;
if(n==0) return0;
sum = find(A, n-1)
if (A[n-1]<0) sum=sum+1;
return sum;
}
Q. What is the worst case running time above function find (A[], n) when array A has 0 to n-1 elements?

a)
O(1)
b)
O(log n)
c)
O(n)
d)
O(n2)

Correct answer is option 'C'. Can you explain this answer?

Answer

It seems that the code provided is incomplete and missing the closing brace for the if statement. However, based on the given code snippet, it appears to be attempting to find the sum of elements in an array recursively.

Here is a corrected version of the code:

```cpp
int find(int A[], int n) {
int sum = 0;
if (n == 0)
return 0;
sum = find(A, n-1) + A[n-1];
return sum;
}
```

Explanation:
- The function `find` takes an integer array `A` and an integer `n` as parameters.
- It initializes a variable `sum` to 0.
- If `n` is 0 (the base case), it returns 0.
- Otherwise, it calls the function `find` recursively with the array `A` and `n-1` as arguments, and assigns the returned value to `sum`.
- It then adds the value of `A[n-1]` to `sum`.
- Finally, it returns `sum`, which represents the sum of all elements in the array.

Similar GATE Doubts

Consider the following recursive c function: PROGRAMMINGvoid ABC (int i){if(i<1)return;ABC(i-2);ABC(i-4);printf(“%d”, i);}.If the ABC (6) function is being called in main () then how many times will the ABC() function be invoked before returning to the main()?

Consider the following rec function.rec(int x){static int f;if (x==1)return(1);elsef+=x*rec(x-1);return(f);}Find the value returned by rec(5).

Nobody knows yets if p = NP consider the language L defined as follows:Which of the following statement is true?

Top Courses for GATE

Suggested Free Tests

Related Content

Mock Test Series

Subject-wise Courses

Other Engg Branches

Related Exams

Company